package com.future;


import java.lang.*;
import java.util.*;

/**
 * Description: 313. 超级丑数
 *
 * @author weiruibai.vendor
 * Date: 2022/11/1 15:04
 */
public class Solution_313 {

    public static int nthSuperUglyNumber(int n, int[] primes) {
        if (n == 1) {
            return 1;
        }
        PriorityQueue<Integer> queue = new PriorityQueue<>();
        queue.add(1);
        for (int i = 0; i < n; i++) {
            Integer poll = queue.poll();
            /*for (int j = 0; j < ; j++) {
                
            }*/
        }
        return 0;
    }


}
